#include <fstream>

int N, A[200], val, i;

int binary_search(int val)
{
    int i, step;
    for (step = 1; step < N; step <<= 1);
    for (i = 0; step; step >>= 1)
        if (i + step < N && A[i + step] <= val)
           i += step;
    return i;
}

int Binfire(int,int,int);

int main()
{
	freopen("binarysearch.in","r",stdin);
	freopen("binarysearch.out","w",stdout);
	scanf("%d%d",&N,&val);
	for (i=1;i<=N;++i)
		scanf("%d",&A[i]);
	printf("%d",binary_search(val));
	return 0;
}

int Binfire(int Val,int St,int Dr)
{
	if ( St==Dr )
		return St;
	Mid=(St+Dr)/2;
	if ( A[Mid]>Val )
		return Binfire(Val,St,Mid-1);
	return Binfire(Val,Mid+1,Dr);
}